- 對(duì)分查找樹(shù)
- 對(duì)分檢索樹(shù)
- 二叉查找樹(shù)
- 二叉檢索樹(shù)
- 二叉排序樹(shù)
- 二叉搜索樹(shù)
- 二元搜索樹(shù)
- 二元搜尋樹(shù)
下載手機(jī)詞典可隨時(shí)隨地查詞查翻譯
binary search tree中文什么意思
例句與用法
- 更多例句： 下一頁(yè)
- On the subtrees of random binary search trees
隨機(jī)二叉搜索樹(shù)的子樹(shù) - A binary search tree is a binary tree with the following properties
二進(jìn)制搜索樹(shù)( bst )是具有以下屬性的二進(jìn)制樹(shù)： - Binary search tree
二叉查找樹(shù) - Binary search trees are useful for finding items in a list that changes infrequently
二叉搜索樹(shù)在查找經(jīng)常變化的列表時(shí)是很非常有用的。 - Add and remove operations are typically expensive since binary search trees require that a tree be balanced
通常需要增加和刪除操作，因?yàn)槎鏄?shù)需要被平衡。
百科釋義
In computer science, a binary search tree (BST), sometimes also called an ordered or sorted binary tree, is a node-based binary tree data structure
詳細(xì)百科解釋